Clustering with the Average Silhouette Width

نویسندگان

چکیده

The Average Silhouette Width (ASW) is a popular cluster validation index to estimate the number of clusters. question whether it also suitable as general objective function be optimized for finding clustering addressed. Two algorithms (the standard version OSil and fast FOSil) are proposed, they compared with existing methods in an extensive simulation study covering known unknown numbers Real data sets analysed, partly exploring use new non-Euclidean distances. ASW shown satisfy some axioms that have been proposed quality functions. prove useful sensible many cases, but weaknesses highlighted. These concern estimating clusters together other methods, which interest due popularity this task.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Average Cost Clustering

A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the ...

متن کامل

Networks with the Smallest Average Distance and the Largest Average Clustering

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance, ignoring their average clustering. The form of t...

متن کامل

Ju l 2 01 0 Networks with the Smallest Average Distance and the Largest Average Clustering

We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the smallest possible average distance. In contrast, there are many graphs with the same minimum average distance, ignoring their average clustering. The form of t...

متن کامل

Person Identification using Gait by Combined Features of Width and Shape of the Binary Silhouette

Current image-based individual human recognition methods, such as fingerprints, face, or iris biometric modalities generally require a cooperative subject, views from certain aspects, and physical contact or close proximity. These methods cannot reliably recognize non-cooperating individuals at a distance in the real world under changing environmental conditions. Gait, which concerns recognizin...

متن کامل

Silhouette + attraction: A simple and effective method for text clustering

This article presents Sil-Att, a simple and effective method for text clustering, which is based on two main concepts: the silhouette coefficient and the idea of attraction. The combination of both principles allows us to obtain a general technique that can be used either as a boosting method, which improves results of other clustering algorithms, or as an independent clustering algorithm. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics & Data Analysis

سال: 2021

ISSN: ['0167-9473', '1872-7352']

DOI: https://doi.org/10.1016/j.csda.2021.107190